The Synchronic Group: A Concurrent Programming Concept and Its Proof Logic

نویسندگان

  • Gruia-Catalin Roman
  • H. Conrad Cunningham
چکیده

Swarm is a computational model which extends UNITY in three important ways: (1) UNITY's fixed set of variables is replaced by an unbounded set of tuples which are addressed by content rather than by name; (2) UNITY's static set of statements is replaced by a dynamic set of transactions; and (3) UNITY's static IIcomposition is augmented by dynamic coupling of transactions into synchronic groups. This paper overviews the Swarm model, introduced the synchronic group concept, and illustrates their use in the expression of dynamically structured programs. A UNITY-style programming logic is given for SWARM, the first axiomatic proof system for a shared database language.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning About Synchronic Groups

Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are addressed by content rather than by name; (2) UNITY’s static set of statements is replaced by a dynamic set of transactions; and (3) UNITY’s static ‖-composition is augmented by dynamic coupling of transactions into synchron...

متن کامل

Reasoning about Synchronic Groups

Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY's fixed set of variables is replaced by an unbounded set of tuples which are addressed by content rather than by name; (2) UNITY's static set of statements is replaced by a dynamic set of transactions; and (3) UNITY's state II-composition is augmented by dynamic coupling of transactions into synchron...

متن کامل

Concurrent programming as proof net construction

We propose a concurrent process calculus, called Calcul Parall ele Logique (CPL), based on the paradigm of computation as proof net construction in linear logic. CPL uses a fragment of rst order intuitionistic linear logic where formulas represent processes and proof nets successful computations. In these computations, communication is expressed in an asynchronous way by means of axiom links. W...

متن کامل

Fuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma

The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.

متن کامل

Specifying and Executing Protocols for Cooperative Action

The purpose of this paper is twofold: (i) to illustrate and re-emphasize the use of CONCURRENT METATEM, a programming language based on executable temporal logic, as a viable framework in which to develop Distributed Artificial Intelligence (DAI) applications; and (ii) to present a specific example of a cooperative protocol, give an outline of its implementation in CONCURRENT METATEM, and show ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990